Leveraging the Expressivity of Grounded Conjunctive Query Languages
نویسندگان
چکیده
We present a pragmatic extension of a Semantic Web query language (including so-called grounded conjunctive queries) with a termination safe functional expression language. This addresses problems encountered in daily usage of Semantic Web query languages for which currently no standardized solutions exist, e.g., how to define aggregation operators and used-defined filter predicates. We claim that the solution is very flexible, since users can define and execute ad hoc extensions efficiently and safely on the Semantic Web reasoning server without having to devise and compile specialized “built-ins” and “plugins” in advance. We also address the scalability aspect by showing how aggregation operators can be realized efficiently in this framework.
منابع مشابه
Conjunctive Context-Free Path Queries
In graph query languages, regular expressions are commonly used to specify the labeling of paths. A natural step in increasing the expressive power of these query languages is replacing regular expressions by context-free grammars. With the Conjunctive Context-Free Path Queries (CCFPQ) we introduce such a language based on the well-known Conjunctive Regular Path Queries (CRPQ). First, we show t...
متن کاملA Practical Approach for Scalable Conjunctive Query Answering on Acyclic EL Knowledge Base
Conjunctive query answering for EL ontologies has recently drawn much attention, as the Description Logic EL captures the expressivity of many large ontologies in the biomedical domain and is the foundation for the OWL 2 EL profile. In this paper, we propose a practical approach for conjunctive query answering in a fragment of EL, namely acyclic EL, that supports role inclusions. This approach ...
متن کاملSecond-Order Queries for Rule-Based Data Access
Rules and ontologies can be used to enrich a database system with advanced data access capabilities. The success of this paradigm has led to a number of languages such as DL-Lite, Datalog+/and OWL RL. The two major approaches to answering queries under constraints expressed in such languages are forward-chaining (materialization) and backward-chaining (query rewriting). The latter is typically ...
متن کاملRewriting Conjunctive Queries under Description Logic Constraints
We consider the problems of conjunctive query answering and rewriting under Description Logic constraints. We present a query rewriting algorithm for ELHI knowledge bases, and use it to show that query answering in this setting is PTime-complete w.r.t. data complexity. We show that our algorithm is worst-case optimal for languages with data complexity of query answering ranging from LogSpace to...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007